memory complexity


memory complexity
сложность по памяти

English-Russian cryptological dictionary . 2014.

Смотреть что такое "memory complexity" в других словарях:

  • Memory disambiguation — is a set of techniques employed by high performance out of order execution microprocessors that execute memory access instructions (loads and stores) out of program order. The mechanisms for performing memory disambiguation, implemented using… …   Wikipedia

  • Memory bound function — Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of available memory to hold data. In other words, the limiting factor of solving a given problem is the memory… …   Wikipedia

  • Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… …   Wikipedia

  • Memory hierarchy — Diagram of the computer memory hierarchy See also: Computer data storage The term memory hierarchy is used in the theory of computation when discussing performance issues in computer architectural design, algorithm predictions, and the lower… …   Wikipedia

  • Memory card — Miniaturization is evident in memory card creation; over time, the physical card sizes grow smaller. A memory card or flash card is an electronic flash memory data storage device used for storing digital information. They are commonly used in… …   Wikipedia

  • Memory-mapped I/O — For more generic meanings of input/output port, see Computer port (hardware). MMIO redirects here. For the airport serving Saltillo, Mexico, assigned the ICAO code MMIO, see Plan de Guadalupe International Airport. Memory mapped I/O (MMIO) and… …   Wikipedia

  • Context of computational complexity — In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires… …   Wikipedia

  • Cognitive complexity — Psychology Cognitive psychology Perception …   Wikipedia

  • L (complexity) — In computational complexity theory, L (also known as LSPACE) is the complexity class containing decision problems which can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to …   Wikipedia

  • The Complexity of Songs — was an article published by Donald Knuth, an example of an in joke in computer science, namely, in computational complexity theory. The article capitalizes on the tendency of popular songs to evolve from long and content rich ballads to highly… …   Wikipedia

  • P (complexity) — In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of… …   Wikipedia

Книги

Другие книги по запросу «memory complexity» >>


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.